منابع مشابه
On strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملStrongly nil-clean corner rings
We show that if $R$ is a ring with an arbitrary idempotent $e$ such that $eRe$ and $(1-e)R(1-e)$ are both strongly nil-clean rings, then $R/J(R)$ is nil-clean. In particular, under certain additional circumstances, $R$ is also nil-clean. These results somewhat improves on achievements due to Diesl in J. Algebra (2013) and to Koc{s}an-Wang-Zhou in J. Pure Appl. Algebra (2016). ...
متن کاملE-Clean Matrices and Unit-Regular Matrices
Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.
متن کاملA NOTE VIA DIAGONALITY OF THE 2 × 2 BHATTACHARYYA MATRICES
In this paper, we consider characterizations based on the Bhattacharyya matrices. We characterize, under certain constraint, dis tributions such as normal, compound poisson and gamma via the diago nality of the 2 X 2 Bhattacharyya matrix.
متن کاملSome classes of strongly clean rings
A ring $R$ is a strongly clean ring if every element in $R$ is the sum of an idempotent and a unit that commutate. We construct some classes of strongly clean rings which have stable range one. It is shown that such cleanness of $2 imes 2$ matrices over commutative local rings is completely determined in terms of solvability of quadratic equations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2013
ISSN: 1015-8634
DOI: 10.4134/bkms.2013.50.1.125